How to Launch A Birthday Attack Against DES
نویسنده
چکیده
We present a birthday attack against DES. It is entirely based on the relationship Li+1 = Ri and the simple key schedule in DES. It requires about 2 ciphertexts of the same R16, encrypted by the same key K. We conjecture it has a computational complexity of 2. Since the requirement for the birthday attack is more accessible than that for Differential cryptanalysis, Linear cryptanalysis or Davies’ attack, it is of more practical significance.
منابع مشابه
Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
This paper studies how to build a 2n-bit block cipher which is hard to distinguish from a truly random permutation against attacks with q ≈ 2 queries, i.e., birthday attacks. Unlike previous approaches using pseudorandom functions, we present a simple and efficient proposal using a tweakable block cipher as an internal module. Our proposal is provably secure against birthday attacks, if underly...
متن کاملFSBday: Implementing Wagner’s generalized birthday attack against the SHA-3⋆ candidate FSB
The hash function FSB is one of the candidates submitted to NIST’s competition to find the new standard hash function, SHA-3. The compression function of FSB is based on error correcting codes. In this paper we show how to use Wagner’s generalized birthday attack to find collisions in FSB’s compression function. In particular, we present details on our implementation attacking FSB48, a toy vers...
متن کاملImplementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB
This paper applies generalized birthday attacks to the FSB compression function, and shows how to adapt the attacks so that they run in far less memory. In particular, this paper presents details of a parallel implementation attacking FSB48, a scaled-down version of FSB proposed by the FSB submitters. The implementation runs on a cluster of 8 PCs, each with only 8GB of RAM and 700GB of disk. Th...
متن کاملFSBday: Implementing Wagner’s generalized birthday attack against the SHA-3⋆ round-1 candidate FSB
This paper applies generalized birthday attacks to the FSB compression function, and shows how to adapt the attacks so that they run in far less memory. In particular, this paper presents details of a parallel implementation attacking FSB48, a scaled-down version of FSB proposed by the FSB submitters. The implementation runs on a cluster of 8 PCs, each with only 8GB of RAM and 700GB of disk. Th...
متن کاملImproving the efficiency of Generalized Birthday Attacks against certain structured cryptosystems
1 Technische Universität Darmstadt Fachbereich Informatik, Kryptographie und Computeralgebra, 10 Hochschulstraße, 64289 Darmstadt, Germany {rniebuhr,buchmann}@cdc.informatik.tu-darmstadt.de 2 CASED – Center for Advanced Security Research Darmstadt, 32 Mornewegstrasse, 64293 Darmstadt, Germany [email protected] Abstract. Code-based cryptographic schemes are promising candidates for po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008